On Mixed and Componentwise Condition Numbers for Moore-Penrose Inverse and Linear Least Square Problems
نویسندگان
چکیده
In this talk, we discuss the maximum number of n × n pure imaginary quaternionic solutions to the Hurwitz matrix equations given by T i T * j + T j T Abstract Let T be a bounded linear operator on a complex Hilbert space H. For 0 ≤ q ≤ 1, the
منابع مشابه
On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems
Classical condition numbers are normwise: they measure the size of both input perturbations and output errors using some norms. To take into account the relative of each data component, and, in particular, a possible data sparseness, componentwise condition numbers have been increasingly considered. These are mostly of two kinds: mixed and componentwise. In this paper, we give explicit expressi...
متن کاملOn level-2 condition number for the weighted Moore-Penrose inverse
In this paper, we present characterizations for the level-2 condition number of the weighted Moore–Penrose inverse, i.e., condMN (A) ≤ cond [2] MN (A) ≤ condMN (A)+ 1, where condMN (A) is the condition number of the weighted Moore–Penrose inverse of a rectangular matrix and cond [2] MN (A) is the level-2 condition number of this problem. This paper extends the result by Cucker, Diao and Wei [F....
متن کاملPenrose Inverse of Bidiagonal Matrices
Introduction. For a real m×n matrix A, the Moore–Penrose inverse A+ is the unique n×m matrix that satisfies the following four properties: AAA = A , AAA = A , (A+A)T = AA , (AA+)T = AA (see [1], for example). If A is a square nonsingular matrix, then A+ = A−1. Thus, the Moore–Penrose inversion generalizes ordinary matrix inversion. The idea of matrix generalized inverse was first introduced in ...
متن کاملA generalization of the Moore-Penrose inverse related to matrix subspaces of Cn×m
A natural generalization of the classical Moore-Penrose inverse is presented. The so-called S-Moore-Penrose inverse of a m × n complex matrix A, denoted by AS, is defined for any linear subspace S of the matrix vector space Cn×m. The S-Moore-Penrose inverse AS is characterized using either the singular value decomposition or (for the nonsingular square case) the orthogonal complements with resp...
متن کاملOn the Solution of Constrained and Weighted Linear Least Squares Problems
Important problems in many scientific computational areas are least squares problems. The problem of constraint least squares with full column weight matrix is a class of these problems. In this presentation, we are concerned with the connection between the condition numbers and the rounding error in the solution of the problem of constrained and weighted linear least squares. The fact that thi...
متن کامل